A Unified Approach to Difference Sets with gcd (v,n) >1
نویسندگان
چکیده
The five known families of difference sets whose parameters (v,k,>.;n) satisfy the condition gcd(v,n) > 1 are the McFarland, Spence, Davis-Jedwab, Hadamard and Chen families. We survey recent work which ursive techniques to unify these difference set families, placing particular emphasis on examples. This unified approach has also proved useful for studying semi-regular relative difference sets and for constructing new etric designs.
منابع مشابه
Relative ( pn , p , pn , n ) - difference sets with GCD ( p , n ) = 1
Let p be an odd prime. We first get some non-existence and structural results on (pn,p,pn,n) relative difference sets with gcd(p,n)= 1 through a group ring approach. We then give a construction of (p(p+ 1),p,p(p+ 1),p+ 1) relative difference sets with p a Mersenne prime.
متن کاملThe Accelerated Euclidean Algorithm
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log n log log n) time complexity of the Schönhage algorithm for n-bit inputs. This new GCD algorithm is designed for both integers and polynomials. We only focus our study to the integer case, the polynomial case is currently addressed [3]. The algorithm is based on a half-gcd like pro...
متن کاملOptimal Locating and Sizing of Unified Power Quality Conditioner- phase Angle Control for Reactive Power Compensation in Radial Distribution Network with Wind Generation
In this article, a multi-objective planning is demonstrated for reactive power compensation in radial distribution networks with wind generation via unified power quality conditioner (UPQC). UPQC model, based on phase angle control (PAC), is used. In presented method, optimal locating of UPQC-PAC is done by simultaneous minimizing of objective functions such as: grid power loss, percentage of n...
متن کاملLong Arithmetic Progressions in Sets with Small Sumset
Let A, B ⊆ Z be finite, nonempty subsets with minA = minB = 0, and let δ(A,B) = n 1 if A ⊆ B, 0 otherwise. If maxB ≤ maxA ≤ |A|+ |B| − 3 and (1) |A+B| ≤ |A|+ 2|B| − 3− δ(A,B), then we show A + B contains an arithmetic progression with difference 1 and length |A|+ |B| − 1. As a corollary, if (1) holds, max(B) ≤ max(A) and either gcd(A) = 1 or else gcd(A+ B) = 1 and |A+B| ≤ 2|A|+ |B| − 3, then A+...
متن کاملAsymptotic estimates for phi functions for subsets of {m
Let f (m, n) denote the number of relatively prime subsets of {m+ 1, m + 2,. .. , n}, and let Φ(m, n) denote the number of subsets A of {m + 1, m + 2,. .. , n} such that gcd(A) is relatively prime to n. Let f k (m, n) and Φ k (m, n) be the analogous counting functions restricted to sets of cardinality k. Simple explicit formulas and asymptotic estimates are obtained for these four functions. A ...
متن کامل